Linear forests and ordered cycles
نویسندگان
چکیده
A collection L = P 1 ∪ P 2 ∪ · · · ∪ P t (1 ≤ t ≤ k) of t disjoint paths, s of them being singletons with |V (L)| = k is called a (k, t, s)-linear forest. A graph G is (k, t, s)ordered if for every (k, t, s)-linear forest L in G there exists a cycle C in G that contains the paths of L in the designated order as subpaths. If the cycle is also a hamiltonian cycle, then G is said to be (k, t, s)-ordered hamiltonian. We give sharp sum of degree conditions for nonadjacent vertices that imply a graph is (k, t, s)-ordered hamiltonian.
منابع مشابه
Minimal Ordered Ramsey Graphs
An ordered graph is a graph equipped with a linear ordering of its vertex set. A pair of ordered graphs is Ramsey finite if it has only finitely many minimal ordered Ramsey graphs and Ramsey infinite otherwise. Here an ordered graph F is an ordered Ramsey graph of a pair (H,H ′) of ordered graphs if for any coloring of the edges of F in colors red and blue there is either a copy of H with all e...
متن کاملA Note on The Linear Arboricity of Planar Graphs without 4-Cycles∗
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that if G is a planar graph with ∆(G) ≥ 5 and without 4-cycles, then la(G) = ⌈∆(G) 2 ⌉. Moreover, the bound that ∆(G)≥ 5 is sharp.
متن کاملAlmost every graph can be covered by d ∆ 2 e linear forests
A linear forest is the union of a set of vertex disjoint paths. Akiyama, Exoo and Harary and independently Hilton have conjectured that the edges of every graph of maximum degree ∆ can be covered by d∆+1 2 e linear forests. We show that almost every graph can be covered with this number of linear forests. 1 Linear Forests, Directed Cycles, and the Probabilistic Method A linear forest is the uni...
متن کاملThe Linear Arboricity of Planar Graphs without 5-Cycles with Chords
The linear arboricity la(G) of a graph G is the minimum number of linear forests which partition the edges of G. In this paper, it is proved that for a planar graph G with maximum degree ∆(G)≥ 7, la(G) = d(∆(G))/2e if G has no 5-cycles with chords. 2010 Mathematics Subject Classification: 05C15
متن کاملChromatic number of ordered graphs with forbidden ordered subgraphs
It is well-known that the graphs not containing a given graph H as a subgraph have bounded chromatic number if and only if H is acyclic. Here we consider ordered graphs, i.e., graphs with a linear ordering ≺ on their vertex set, and the function f≺(H) = sup{χ(G) | G ∈ Forb≺(H)}, where Forb≺(H) denotes the set of all ordered graphs that do not contain a copy of H. If H contains a cycle, then as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 24 شماره
صفحات -
تاریخ انتشار 2004